Senthilkumar Mathi ¹, M. Lavanya ¹, R. Priyanka ¹

Affiliations
1 Amrita School of Engineering, Amrita Vishwa Vidyapeetham (University), Coimbatore, Tamilnadu, IN

Abstract

Increasing population of mobile users has lead to the demand of higher mobility support. Many protocols have been standardized for mobility management such as Mobile Internet Protocol version 6, hierarchical mobile IPv6 and proxy mobile IPv6 and so on. The predominantly used approach in the existing mobile networks is the centralized mobility management. In this, the messages transferred between mobile node and correspondent node must pass through each level due to the hierarchical architecture. When a mobile network is implemented with the centralized architecture, the messages are routed to the MN irrespective of its location using mobile IP for continuing services during the handover. But this approach is susceptible to issues such as single point of failure, non-optimized routes, latency issues, wastage of resources and security threats which affect the performance and scalability, demanding a flatter architecture with an efficient mechanism to face the traffic overload from the mobile users. Hence, the paper proposes a new scheme to form a flatter architecture by distributing the mobility management functionalities as distributed access point at the access level. The resistance against security threat such as man-in-the-middle attack, replay attack and false binding update attack has been achieved. Finally, numerical results show that the proposed scheme provides significant reduction in signaling cost and improves efficiency in route optimization.

Keywords

Binding Acknowledgement, Binding Cache, Binding Update, Distributed Access Point, Distributed Mobility Management

Full Text

   

M. Lavanya ¹, R. Vijay Sai ¹, A. Festina ², J. Eshwari ², T. Manopriya ², V. Vaithiyanathan ¹

Affiliations
1 School of Computing, SASTRA University, Thanjavur – 613401, Tamil Nadu, IN
2 Information and Communication Technology, SASTRA University, Thanjavur – 613401, Tamil Nadu, IN

Abstract

This article aims to focus on encryption based algorithm on ASCII value and Random number generator. Proposed algorithm has been developed with the view to achieve data security and prevent unauthorized persons from meddling with such secret data. An ASCII based conversion has been implemented to encrypt shorter length messages through a symmetric key. The algorithm specifically accommodates the concept of random number generation that makes it tough for the hackers to decrypt despite accidentally discovering the key. This concept also involves floating point numbers for encryption to enhance the difficulty level of cryptanalysis. Hence this algorithm will provide an efficient way to make it almost impossible for the intruders to track the message.

Keywords

ASCII, Encryption, Hackers, Random Number, Symmetric Key

Full Text

   

K. Naveen ¹, S. Saravanan ¹, M. Lavanya ¹, V. Vaithayanathan ²

Affiliations
1 School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN
2 SASTRA University, Thanjavur - 613401, Tamil Nadu, IN

Abstract

This article aims to present the importance of authentication for E-mail ID through improved CAPTCHA based method.The structure of the CAPTCHA has to be reorganized to suit the user requirements to facilitate the authentication for E-mail ID. CAPTCHA is achieved by rearrangement of alphabets randomly on the buttons and it is very easy to frustrate by simple keyloggers. The motive of improving E-mail authentication is done by incorporating two factor visual authentication mechanisms. It is targeted to CAPTCHA based human interaction with sophisticated user friendly protocol. All the intermediate interaction is visualized by the user with better CAPTCHA code. It provides only one time (or) one session valid authentication through color grid rating method. This two layer authentication promises more secure in accessing any secure information based portal.

Keywords

Authentication, CAPTCHA, E-mail, Hacker Attack, Keyloggers

Full Text

   

M. Lavanya ¹, Aarthi Ravi ², Ajay Aditya ², Rukmani Samyuktha ², V. Vaithiyanathan ¹, S. Saravanan ¹

Affiliations
1 School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN
2 SASTRA University, Thanjavur - 613401, Tamil Nadu, IN

Abstract

This paper aims to bring enhanced load balancing scheduling on private cloud computing. As cloud computing has become a developing and emerging area, the need for a cloud becomes mandatory in working areas. The advantage of technology in their own data centers to evolve a private cloud. Due to the presence of private cloud and to fulfill its unique characteristics and special requirements, it becomes a challenging task to optimally schedule virtual machine instances requests onto nodes to compute when there are multiple tasks to satisfy. In this paper, we discuss about load balancing, which is to schedule task among various end users. The scheduling algorithm used is Round Robin algorithm. This algorithm reduces the response time and improves the processing speed. According to this algorithm the nodes are allocated to the virtual machines along with their corresponding task to a particular node in a cyclic fashion. Each node in the cloud is scheduled equally with the task until all the tasks in the global queue all allocated.

Keywords

Cloud Computing, Load Balancing, Private Cloud, Round Robin Algorithm, Scheduling

Full Text

   

M. Lavanya ¹, G. Aishwarya ², S. Keerthana ², V. Vaithiyanathan ¹, S. Saravanan ¹

Affiliations
1 School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN
2 Information and Communication Technology, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN

Abstract

This article aims to bring a novel method in cipher algorithm for secure aware communication. This paper proposes a unique scheme and ensures higher security during encryption and decryption process. The Key (ki) is generated for every Plain text pi. Plain text and key are converted to their equivalent ASCII values, by which the scrambled Cipher text (ci) is generated by implementing some of the concepts of the substitution techniques. During Decryption, the corresponding (ki) are used to recover the Plain text pi. It makes sure the need to send the full length key along with the cipher text for decryption process. The suggested method assures the greater security during transmission. There is a practical hindrance in guessing the Number of rounds (N) and the number of bits n shifted, by Cryptanalyst. This method will be more suitable for analyzing the discover key (ki) values from attempting Brute Force technique.

Keywords

Ciper Algorithms, Cryptanalyst, Decryption, Encryption, Secure Communication

Full Text

   

M. Lavanya ¹, T. N. Janani ², S. Sushmita ², M. Sunandha ², V. Vaithiyanathan ¹, S. Saravanan ¹

Affiliations
1 School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN
2 Information and Communication Technology, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN

Abstract

This article mainly focused on cloud scheduling with constraint based decentralized task routing. The job of scheduling tasks across various nodes in a hierarchical network scenario is an exigent problem. The concept of decentralized distribution scheme proposed in base paper is time-consuming since it has to compute the availability function for each and every node. In this paper we proposed a CBDA (Constraint Based Decentralized Algorithm) which offers the expediency of being quick and “Make-span minimization policy” is implemented to reduce the completion time of the currently executing nodes. In our presumption, the submission nodes are semi centralized and it can store the availability information of the nodes or routers within its area. This paper considers the allotment of the tasks to the execution nodes which are unoccupied by other tasks. The dynamic allotment of the tasks to the nodes in the tree based approach is the major criteria for selecting the desired node. This paper proposes a trade-off between fully centralized model and the decentralized model by implementing a new constraint based decentralization scheme which saves time consumption and enhances efficiency of task scheduling.

Keywords

Cloud Computing, Constraint based Method Scheduling, Decentralized Router, Dynamic Task

Full Text

   

M. Lavanya ¹, V. Vaithiyanathan ²

Affiliations
1 School of Computing, SASTRA University, Thanjavur – 613401, Tamil Nadu
2 School of Computing, SASTRA University, Thanjavur – 613401, Tamil Nadu, IN

Abstract

This paper presents dynamic resource allocation in cloud computing using load prediction algorithm. Cloud computing is a technology that is of increasing demand these days. Cloud computing provides various kinds of services to the users. In cloud computing the provider dynamically allocate the resources. Doing so, the service provider should have some knowledge about the future resource needs. They can be calculated using the load prediction algorithms. In this paper an algorithm named Enhanced Exponentially Weighted Moving Average (EEWMA) is used to predict the load, which is efficient in terms of both overload avoidance and green computing. EEWMA algorithm predicts the future need of resources effectively and it is suitable for both increasing and decreasing need of resources. This proposed load prediction will be well suitable for overload avoidance applications.

Keywords

Cloud Computing, Dynamic Resource Allocation, Green Computing, Load Prediction, Resources

Full Text

   

T. Prasannakumar ¹, K. Thangaprakash ¹, S. Saravanan ², M. Lavanya ², V. Vaithayanathan ³

Affiliations
1 B. Tech Information Technology, School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN
2 School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN
3 Research, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN

Abstract

This proposed work aims to show the importance of personalized web search with improved privacy protection. To protect user profile based on Personalized Web Search (PWS), we need to consider few major issues during web site search processing. It is possible to improve efficient search based method with the personalized usage method of the accessing new user profile and prevent the privacy contents, which exists in the user profile method to adopt the risk privacy under control. User privacy can be safe without compromising the web search if personalized search quality. User Profile Search Engine (UPSE) is typically offline with all queries received from a same user. This article provides an inexpensive method for the user clientto conform whether to personalize a web search query in UPSE. This can avoid the unnecessary experience of the profile. Expected results can be evident that UPSE can achieve better quality based search results. So this proposed method is more applicable for personalized web portal.

Keywords

Greedy Algorithms, Personalized Web Search, Privacy Preserving Personalized, User Profile Search Engine

Full Text